Operational and Logical Semantics for Polling Real-Time Systems
نویسندگان
چکیده
PLC Automata are a class of real time automata suitable to describe the behaviour of polling real time systems PLC Automata can be compiled to source code for PLCs a hardware widely used in industry to control processes Also PLC Automata have been equipped with a logical and operational semantics using Duration Calculus DC and Timed Automata TA respectively The three main results of this paper are A simpli ed operational semantics A minor extension of the logical semantics and a proof that this semantics is complete relative to our operational semantics This means that if an observable satis es all formulas of the DC seman tics then it can also be generated by the TA semantics A proof that the logical semantics is sound relative to our operational semantics This means that each observable that is accepted by the TA semantics constitutes a model for all formulas of the DC semantics
منابع مشابه
Speciication and Veriication of Polling Real-time Systems
Formal methods for real-time systems are an important topic of contemporary research. The aim is to cope with the additional complexity of \time" in speciication and veriication. In Die99a] we present an approach to the correct design of real-time programs implemented on \Programmable Logic Controllers" (PLCs). This hardware executes repeatedly an application program whereas each cycle has an u...
متن کاملClocks Model for Specification and Analysis of Timing in Real-Time Embedded Systems
Problems concerning formal semantics for Clock Constraint Specification Language (CCSL) are considered in the paper. CCSL is intended for describing logical time models for real-time embedded systems and the language is a part of UML profile for MARTE. There exist two approaches to introduce a denotational semantics for CCSL. A pure relational subset of CCSL is defined in the paper. The notion ...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملOperational semantics of logical concurrent systems
We describe the operational semantics of the language for modelling logical concurrent systems (LCS). Such systems are characterised by atomic synchronous uniication. The model permits the description of both dependant and independent simultaneous actions or sets of atomic events. A semantics is given via labelled transition systems. The notion of equivalence over such systems is deened by stro...
متن کاملA generalization of the Chen-Wu duality into quantale-valued setting
With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...
متن کامل